Symbolic Model Checking without BDDs
نویسندگان
چکیده
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stålmarck’s Method [16] or the Davis & Putnam Procedure [7], can replace BDDs. This new technique avoids the space blow up of BDDs, generates counterexamples much faster, and sometimes speeds up the verification. In addition, it produces counterexamples of minimal length. We introduce a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability. We show that bounded LTL model checking can be done without a tableau construction. We have implemented a model checker BMC, based on bounded model checking, and preliminary results are presented.
منابع مشابه
Verifying Safety Properties of a PowerPC 1 Microprocessor Using Symbolic Model Checking without BDDs
In [2] Bounded Model Checking with the aid of satis ability solving (SAT) was introduced as an alternative to traditional symbolic model checking based on solving xpoint equations with BDDs. In this paper we show how bounded model checking can take advantage of specialized optimizations. We present a bounded version of the cone of in uence reduction that works very well for verifying safety pro...
متن کاملVerifying Safety Properties of a Powerpc Tm ? Microprocessor Using Symbolic Model Checking without Bdds ??
In 1] Bounded Model Checking with the aid of satissability solving (SAT) was introduced as an alternative to symbolic model checking with BDDs. In this paper we show how bounded model checking can take advantage of specialized optimizations. We present a bounded version of the cone of innuence reduction. We have successfully applied this idea in checking safety properties of a PowerPC microproc...
متن کاملVerifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs
In [1] Bounded Model Checking with the aid of satisfiability solving (SAT) was introduced as an alternative to symbolic model checking with BDDs. In this paper we show how bounded model checking can take advantage of specialized optimizations. We present a bounded version of the cone of influence reduction. We have successfully applied this idea in checking safety properties of a PowerPC microp...
متن کاملBDD-Based Software Model Checking with CPAchecker
In symbolic software model checking, most approaches use predicates as symbolic representation of the state space, and SMT solvers for computations on the state space; BDDs are sometimes used as auxiliary data structure. The representation of software state spaces by BDDs was not yet thoroughly investigated, although BDDs are successful in hardware verification. The reason for this is that BDDs...
متن کاملSymbolic Model Checking by Automata Based Set Representation
Binary Decision Diagrams (BDDs) are normally used in symbolic state space traversal to implicitly store and manipulate sets. As small BDDs can represent very large sets, it is possible to verify huge state spaces with this methodology. However, it is also well-known that certain systems do not have a compact (polynomial sized) BDD representation. Therefore, we propose a new technique for symbol...
متن کامل